D: The Infinite Square Roots of –1
نویسندگان
چکیده
We present D, a symbol that can be used in the universal alphabet that provides a computational path to the nilpotent Dirac equation (Diaz & Rowlands, 2004) and which results in a tractable computer representation of the infinite square roots of –1. We outline how the representation is derived, the properties of the representation, and how the form can be used. Think of D as an infinite table of 1’s in any representation e.g. binary or hexadecimal. Any specified column Di of the table has the property that when multiplied with a row Di , the result is a representation of –1. Di multiplied with Dj anticommutes as – (Dj*Di ) and produces Dk in a way identical to Hamilton’s quaternion i, j, and k. With an infinite and uniquely identifiable set of such triad forms D can be considered both a symbol and because of this behaviour, an alphabet.
منابع مشابه
In-Depth Coverage of the Icon Programming Language and Applications Solving Square-Root Palindromes
In the last article on square-root palindromes [1], we investigated constant square-root palindromes (those in which all terms are the same) using a combination of programs, guesses, and deduction. In this article, we’ll take a different approach: solving continued fractions to get data from which to derive more information about square-root palindromes. In a previous article [2], we showed a m...
متن کاملBack to the roots of the M / D / s queue and the works of Erlang , Crommelin , and Pollaczek A
A.K. Erlang introduced the M/D/s queue in 1917, while F. Pollaczek and C.D. Crommelin formalized the theory using complex analysis and transforms. Let D(s, λ) denote the stationary probability of experiencing no waiting time in the M/D/s queue with arrival rate λ and service requirement 1. We use D(s, λ) as a vehicle to give an overview of some of the results we obtained over the last years, in...
متن کاملRank-one group actions with simple mixing Z-subactions
Let G be a countable Abelian group with Zd as a subgroup so that G/Zd is a locally finite group. (An Abelian group is locally finite if every element has finite order.) We can construct a rank one action of G so that the Z-subaction is 2-simple, 2-mixing and only commutes with the other transformations in the action of G. Applications of this construction include a transformation with square ro...
متن کاملOn Positive Game Matrices and Their Extensions
In this paper we study some relations between the optimal strategies, the characteristic roots and the characteristic vectors of a positive square matrix whose rows and columns correspond to the pure strategy spaces of players in a zero-sum two-person game. Further we study a property of the game values of positive matrices that commute. The results are extended to infinite games on the unit sq...
متن کاملA Descartes Algorithm for Polynomials with Bit-Stream Coefficients
The Descartes method is an algorithm for isolating the real roots of square-free polynomials with real coefficients. We assume that coefficients are given as (potentially infinite) bit-streams. In other words, coefficients can be approximated to any desired accuracy, but are not known exactly. We show that a variant of the Descartes algorithm can cope with bit-stream coefficients. To isolate th...
متن کامل